全文获取类型
收费全文 | 8191篇 |
免费 | 1286篇 |
国内免费 | 493篇 |
学科分类
数理化 | 9970篇 |
出版年
2024年 | 22篇 |
2023年 | 133篇 |
2022年 | 262篇 |
2021年 | 426篇 |
2020年 | 292篇 |
2019年 | 239篇 |
2018年 | 193篇 |
2017年 | 318篇 |
2016年 | 407篇 |
2015年 | 304篇 |
2014年 | 517篇 |
2013年 | 749篇 |
2012年 | 513篇 |
2011年 | 488篇 |
2010年 | 474篇 |
2009年 | 510篇 |
2008年 | 503篇 |
2007年 | 500篇 |
2006年 | 426篇 |
2005年 | 330篇 |
2004年 | 265篇 |
2003年 | 289篇 |
2002年 | 255篇 |
2001年 | 212篇 |
2000年 | 213篇 |
1999年 | 183篇 |
1998年 | 160篇 |
1997年 | 123篇 |
1996年 | 111篇 |
1995年 | 82篇 |
1994年 | 81篇 |
1993年 | 74篇 |
1992年 | 51篇 |
1991年 | 38篇 |
1990年 | 38篇 |
1989年 | 24篇 |
1988年 | 25篇 |
1987年 | 23篇 |
1986年 | 24篇 |
1985年 | 19篇 |
1984年 | 22篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1978年 | 2篇 |
1977年 | 6篇 |
1973年 | 2篇 |
1959年 | 4篇 |
排序方式: 共有9970条查询结果,搜索用时 312 毫秒
51.
52.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
53.
从大型复杂武器装备系统的具体特点出发,运用基于神经网络的评价方法,构建了大型复杂武器装备质量综合评价模型。实证分析的结果表明该方法得出的结果与实际情况相符。 相似文献
54.
四种多变量校准方法在FTIR多组分分析中的性能比较 总被引:1,自引:0,他引:1
本文对四种多变量校准方法--经典最小二乘法(CLS),偏最小二乘法(PLS),卡尔曼滤波法(KFM)以及人工神经网络法(ANN)--在多组分浓度分析方面的性能进行了比较。选择五种红外谱图严重混叠的大气有机毒物--1,3-丁二烯,苯,邻二甲苯,氯苯和丙烯醛--作为分析对象。分别计算各种方法对该5组分体系的平均预测误差MPE和平均相对误差MRE进行比较。结果表明,偏最小二乘法在处理这类问题中是最稳健的方法。 相似文献
55.
A transient molecular network model is built to describe the nonlinear viscoelasticity of polymers by considering the effect
of entanglement loss and regeneration on the relaxation of molecular strands. It is an extension of previous network theories.
The experimental data on three thermoplastic polymers (ABS, PVC and PA6) obtained under various loading conditions are used
to test the model. Agreement between the theoretical and experimental curves shows that the suggested model can describe successfully
the relaxation behavior of the thermoplastic polymers under different loading rates by using relatively few relaxation modes.
Thus the micromechanism responsible for strain-rate dependence of relaxation process and the origin of nonlinear viscoelasticity
may be disclosed.
The project supported by the National Natural Science Foundation of China and Doctorial Fund 相似文献
56.
57.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
58.
《中国科学A辑(英文版)》2007,(7)
The double loop network(DLN)is a circulant digraph with n nodes and outdegree 2.It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems.Given the number n of nodes,how to construct a DLN which has minimum diameter?This problem has attracted great attention.A related and longtime unsolved problem is:for any given non-negative integer k,is there an infinite family of k-tight optimal DLN?In this paper,two main results are obtained:(1)for any k≥0,the infinite families of k-tight optimal DLN can be constructed,where the number n(k,e,c)of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c.(2)for any k≥0, an infinite family of singular k-tight optimal DLN can be constructed. 相似文献
59.
M. H. Sadr S. Astaraki S. Salehi 《Archive of Applied Mechanics (Ingenieur Archiv)》2007,77(11):795-807
In developing a neural network technique for a finite element model updating, researchers have been shown that the number
of training samples and their quality, significantly affect the accuracy of the NN predication. In this study, based on the
genetic algorithm (GA) method, we reduce the number of analyses required to develop the training pairs and reduce the amount
of time for training the NN. In the other words, a uniform distribution of design points inside the design space will be obtained
by means of this approach. To validate the efficiency of GA sample selection, random generation (RG) method is used for comparison.
Two comparisons are made based on a numerical and experimental example. One is updated from 10 degrees of freedom lumped parameters
system and the other is updated from a free–free beam using test data. The results indicate that the GA sample selection can
reduce the number of training samples without affecting the accuracy of the NN predication. In our present study, also, the
advantages of using frequency response function (FRF) data as input to the NN are kept and the drawback of having too many
frequency points is overcome by the application of principal component analyses (PCA). 相似文献
60.
电力市场中合同电量与竞争电量交易比例的研究 总被引:1,自引:0,他引:1
在单边开放的区域电力市场中,合理的合同电量与竞争电量交易比例是保证电力市场有效运行的一个重要环节。竞争电量所占的比例将主要取决于当前发电公司的市场行为。首先使用BP神经网络对电力需求弹性系数进行了预测,然后以长期电力市场均衡为目标函数,考虑贵州电网发电机组的可用容量与负荷预测的误差,以及贵州输电线路的可靠性诸因素,推导出合同电量与竞争电量交易比例,经过与南方区域电力市场目前运营规则规定的交易比例比较,该比例是合理的,可以规避电力市场价格波动等带来的风险。 相似文献